Abstract
Let Xn = { } 1,2,…,n be a finite n -element set and let Sn An and Dn , be the Symmetric, Alternating and Dihedral groups of Xn , respectively. In this thesis we obtained and discussed formulae for the number of even and odd permutations (of an n − element set) having exactly k fixed points in the alternating group and the generating functions for the fixed points. Further, we give two different proofs of the number of even and odd permutations (of an n − element set) having exactly k fixed points in the dihedral group, one geometric and the other algebraic. In the algebraic proof, we further obtain the formulae for determining the fixed points. We finally proved the three families; F(2r,4r + 2), F(4r +3,8r + 8) and F( ) 4r +5,8r +12 of the Fibonacci groups F( ) m ,n to be infinite by defining Morphism between Dihedral groups and the Fibonacci groups.
Background Of The Study
Advertisement is the collective term for public announcement designed to promot...
ABSTRACT
Radon is one of the sources of nuclear contamination in water and the largest contributor of t...
BACKGROUND OF THE STUDY
There is no question that a country's degree of development is directly rel...
Abstract
The study compared the scores of students in English Language and Integrated Science at the Junior Secondary Sc...
Abstract
The ultimate statement of the proposed system is to over come the problems in the existing sys...
ABSTRACT
This study investigated the impact of personnel management on the performance...
EXCERPT FROM THE STUDY
The traditional poultry keeping is generally subsistence in outlook without the use of modern sci...
Background to the Study
Library did not come into exis...
ABSTRACT
This study was carried out to examine the influence of unemployment on youths involvement...
ABSTRACT
This study was intended to evaluate the impact of pricing on profitability level of an organization. This study...